On-line Algorithms: Competitive Analysis and Beyond
نویسنده
چکیده
منابع مشابه
An Effective Algorithm in a Recommender System Based on a Combination of Imperialist Competitive and Firey Algorithms
With the rapid expansion of the information on the Internet, recommender systems play an important role in terms of trade and research. Recommender systems try to guess the user's way of thinking, using the in-formation of user's behavior or similar users and their views, to discover and then propose a product which is the most appropriate and closest product of user's interest. In the past dec...
متن کاملCompetitive Analysis of Distributed Algorithms
Most applications of competitive analysis have involved on-line problems where a candidate on-line algorithm must compete on some input sequence against an optimal oo-line algorithm that can in eeect predict future inputs. EEorts to apply competitive analysis to fault-tolerant distributed algorithms require accounting for not only this input nondeterminism but also system nondeterminism that ar...
متن کاملOptimization of Cutting Parameters Based on Production Time Using Colonial Competitive (CC) and Genetic (G) Algorithms
A properly designed machining procedure can significantly affect the efficiency of the production lines. To minimize the cost of machining process as well as increasing the quality of products, cutting parameters must permit the reduction of cutting time and cost to the lowest possible levels. To achieve this, cutting parameters must be kept in the optimal range. This is a non-linear optimizati...
متن کاملThe influence of lookahead in competitive on-line algorithms
In the competitive analysis of on-line problems, an on-line algorithm is presented with a sequence of requests to be served. The on-line algorithm must satisfy each request without the knowledge of any future requests. We consider the question of lookahead in on-line problems: What improvement can be achieved in terms of competitiveness, if the on-line algorithm sees not only the present reques...
متن کاملA comparative study of two meta-heuristic algorithms in optimizing cost of reinforced concrete segmental lining
In this work, we tried to automatically optimize the cost of the concrete segmental lining used as a support system in the case study of Mashhad Urban Railway Line 2 located in NE Iran. Two meta-heuristic optimization methods including particle swarm optimization (PSO) and imperialist competitive algorithm (ICA) were presented. The penalty function was used for unfeasible solutions, and the seg...
متن کامل